Efficient Algorithms for Computing Modulo Permutation Theories
Identifieur interne : 006C08 ( Main/Exploration ); précédent : 006C07; suivant : 006C09Efficient Algorithms for Computing Modulo Permutation Theories
Auteurs : Jürgen Avenhaus [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In automated deduction it is sometimes helpful to compute modulo a set E of equations. In this paper we consider the case where E consists of permutation equations only. Here a permutation equation has the form f(x 1,...,x n )=f(x π(1),...,x π( n)) where π is a permutation on {1,...,n}. If E is allowed to be part of the input then even testing E-equality is at least as hard as testing for graph isomorphism. For a fixed set E we present a polynomial time algorithm for testing E-equality. Testing matchability and unifiability is NP-complete. We present relatively efficient algorithms for these problems. These algorithms are based on knowledge from group theory.
Url:
DOI: 10.1007/978-3-540-25984-8_31
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000526
- to stream Istex, to step Curation: 000522
- to stream Istex, to step Checkpoint: 001817
- to stream Main, to step Merge: 006F12
- to stream Main, to step Curation: 006C08
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Algorithms for Computing Modulo Permutation Theories</title><author><name sortKey="Avenhaus, Jurgen" sort="Avenhaus, Jurgen" uniqKey="Avenhaus J" first="Jürgen" last="Avenhaus">Jürgen Avenhaus</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:179D56CF6749304195C7FF1C9B8A08A60372F27F</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-25984-8_31</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-L9ZVDXNC-J/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000526</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000526</idno><idno type="wicri:Area/Istex/Curation">000522</idno><idno type="wicri:Area/Istex/Checkpoint">001817</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001817</idno><idno type="wicri:doubleKey">0302-9743:2004:Avenhaus J:efficient:algorithms:for</idno><idno type="wicri:Area/Main/Merge">006F12</idno><idno type="wicri:Area/Main/Curation">006C08</idno><idno type="wicri:Area/Main/Exploration">006C08</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient Algorithms for Computing Modulo Permutation Theories</title><author><name sortKey="Avenhaus, Jurgen" sort="Avenhaus, Jurgen" uniqKey="Avenhaus J" first="Jürgen" last="Avenhaus">Jürgen Avenhaus</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB Informatik, Technische Universität Kaiserslautern, Kaiserslautern</wicri:regionArea><placeName><region type="land" nuts="2">Rhénanie-Palatinat</region><settlement type="city">Kaiserslautern</settlement></placeName><orgName type="university">Université technique de Kaiserslautern</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In automated deduction it is sometimes helpful to compute modulo a set E of equations. In this paper we consider the case where E consists of permutation equations only. Here a permutation equation has the form f(x 1,...,x n )=f(x π(1),...,x π( n)) where π is a permutation on {1,...,n}. If E is allowed to be part of the input then even testing E-equality is at least as hard as testing for graph isomorphism. For a fixed set E we present a polynomial time algorithm for testing E-equality. Testing matchability and unifiability is NP-complete. We present relatively efficient algorithms for these problems. These algorithms are based on knowledge from group theory.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Kaiserslautern</li></settlement><orgName><li>Université technique de Kaiserslautern</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Avenhaus, Jurgen" sort="Avenhaus, Jurgen" uniqKey="Avenhaus J" first="Jürgen" last="Avenhaus">Jürgen Avenhaus</name></region><name sortKey="Avenhaus, Jurgen" sort="Avenhaus, Jurgen" uniqKey="Avenhaus J" first="Jürgen" last="Avenhaus">Jürgen Avenhaus</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006C08 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006C08 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:179D56CF6749304195C7FF1C9B8A08A60372F27F
|texte= Efficient Algorithms for Computing Modulo Permutation Theories
}}
| This area was generated with Dilib version V0.6.33. |  |